Analytic Euclidean bootstrap
نویسندگان
چکیده
منابع مشابه
The Analytic Bootstrap and AdS Superhorizon Locality
We take an analytic approach to the CFT bootstrap, studying the 4-pt correlators of d > 2 dimensional CFTs in an Eikonal-type limit, where the conformal cross ratios satisfy |u| |v| < 1. We prove that every CFT with a scalar operator φ must contain infinite sequences of operators Oτ,` with twist approaching τ → 2∆φ + 2n for each integer n as `→∞. We show how the rate of approach is controlled b...
متن کاملGeometric and Fourier analytic questions in Euclidean space
We summarize the proof in [5] of a sharp decay estimate for the L2 circular means of the Fourier transform of a measure in R2 with a given fractal dimension. 3.1 Connecting distance sets and spherical means of Fourier transforms of measures Let E be a compact set in R. The corresponding distance set ∆(E) is defined as ∆(E) = {|x − y| : x, y ∈ E}. It is conjectured that if dimE > 1 then |∆(E)| >...
متن کاملAnalytic and bootstrap approximations of prediction errors under a multivariate Fay-Herriot model
A Multivariate Fay-Herriot model is used to aid the prediction of small area parameters of dependent variables with sample data aggregated to area level. The empirical best linear unbiased predictor of the parameter vector is used, and an approximation of the elements of the mean cross product error matrix is obtained by an extension of the results of Prasad and Rao (1990) to the multiparameter...
متن کاملThe formal relationship between analytic and bootstrap approaches to parametric inference
Two routes most commonly proposed for accurate inference on a scalar interest parameter in the presence of a (possibly high-dimensional) nuisance parameter are parametric simulation (‘bootstrap’) methods, and analytic procedures based on normal approximation to adjusted forms of the signed root likelihood ratio statistic. Under some null hypothesis of interest, both methods yield p−values which...
متن کاملThe non-Euclidean Euclidean algorithm
In this paper we demonstrate how the geometrically motivated algorithm to determine whether a twogenerator real Möbius group acting on the Poincaré plane is or is not discrete can be interpreted as a non-Euclidean Euclidean algorithm. That is, the algorithm can be viewed as an application of the Euclidean division algorithm to real numbers that represent hyperbolic distances. In the case that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2019
ISSN: 1029-8479
DOI: 10.1007/jhep10(2019)270